Compiling associativity into logic programs
نویسندگان
چکیده
منابع مشابه
Compiling Prioritized Circumscription into Extended Logic Programs
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain closure axiom and the uniqueness of names axioms can always be compiled into an extended logic program...
متن کاملCompiling Circumscriptive Theories into Logic Programs: Preliminary Report*
We study the possibility of reducing some special cases of circumscription to logic programming. The description of a given circumscriptive theory T can be sometimes transformed into a logic program II, so that, by running II, we can determine whether a given ground literal is provable in T. The method is applicable, in particular, to some formalizations of tree-structured inheritance systems w...
متن کاملCompiling Probabilistic Logic Programs into Sentential Decision Diagrams
Knowledge compilation algorithms transform a probabilistic logic program into a circuit representation that permits efficient probability computation. Knowledge compilation underlies algorithms for exact probabilistic inference and parameter learning in several languages, including ProbLog, PRISM, and LPADs. Developing such algorithms involves a choice, of which circuit language to target, and ...
متن کاملCompiling Multi-Paradigm Declarative Programs into Prolog
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of Curry, is obtained by transforming Curry programs into Prolog programs. Contrary to previous transformations of functional logic programs into Prolog, our implementation includes new mechanisms for both efficiently p...
متن کاملCompiling ER Specifications into Declarative Programs
This paper proposes an environment to support high-level database programming in a declarative programming language. In order to ensure safe database updates, all access and update operations related to the database are generated from high-level descriptions in the entityrelationship (ER) model. We propose a representation of ER diagrams in the declarative language Curry so that they can be con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1987
ISSN: 0743-1066
DOI: 10.1016/0743-1066(87)90010-0